Sum choice numbers of some graphs
نویسندگان
چکیده
منابع مشابه
Sum choice numbers of some graphs
Let f be a function assigning list sizes to the vertices of a graph G. The sum choice number of G is the minimum ∑ v∈V (G) f(v) such that for every assignment of lists to the vertices of G, with list sizes given by f , there exists proper coloring of G from the lists. We answer a few questions raised in a paper of Berliner, Bostelmann, Brualdi, and Deaett. Namely, we determine the sum choice nu...
متن کاملChoice numbers of graphs
A solution to a problem of Erd\H{o}s, Rubin and Taylor is obtained by showing that if a graph $G$ is $(a:b)$-choosable, and $c/d>a/b$, then $G$ is not necessarily $(c:d)$-choosable. The simplest case of another problem, stated by the same authors, is settled, proving that every 2-choosable graph is also $(4:2)$-choosable. Applying probabilistic methods, an upper bound for the $k^{th}$ choice nu...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملZero-Sum Flow Numbers of Regular Graphs
As an analogous concept of a nowhere-zero flow for directed graphs, we consider zero-sum flows for undirected graphs in this article. For an undirected graph G, a zero-sum flow is an assignment of nonzero integers to the edges such that the sum of the values of all edges incident with each vertex is zero, and we call it a zero-sum k-flow if the values of edges are less than k. We define the zer...
متن کاملSum choice number of generalized θ-graphs
Let G = (V,E) be a simple graph and for every vertex v ∈ V let L(v) be a set (list) of available colors. G is called L-colorable if there is a proper coloring φ of the vertices with φ(v) ∈ L(v) for all v ∈ V . A function f : V → N is called a choice function of G and G is said to be f -list colorable if G is L-colorable for every list assignment L with |L(v)| = f(v) for all v ∈ V . The size of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2009
ISSN: 0012-365X
DOI: 10.1016/j.disc.2008.04.044